Arithmetic Function Interpreter in C# 3.0 Using Lambda Expression Trees.
نویسندگان
چکیده
منابع مشابه
Arithmetic Function Interpreter in C# 3.0 Using Lambda Expression Trees
Here the first generic parameter indicates that the independent variable, x, is of type double and the second generic parameter, of type double, is the return type. In general a lambda expression is written as a parameter list, followed by the => token, followed by an expression or a statement block. Expression trees, another new C# 3.0 feature, allow lambda expressions to be represented as dat...
متن کاملImplementing distributed {\lambda}-calculus interpreter
This paper describes how one can implement distributed λ-calculus interpreter from scratch. At first, we describe how to implement a monadic parser, than the Krivine Machine is introduced for the interpretation part and as for distribution, the actor model is used. In this work we are not providing general solution for parallelism, but we consider particular patterns, which always can be parall...
متن کاملA Interpreter for Extended Lambda Calculus
Inspired by ACTORS [7, 17], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [2], but extended for side effects, multiprocessing, and process synchronization. The purpose of this implementation is tutorial. We wish to: 1. alleviate the confusion caused by Micro-PLANNER, CONNIVER, etc., by clarifying the embedding of non-recursive control structur...
متن کاملDiscriminating Lambda-Terms Using Clocked Boehm Trees
As observed by Intrigila [16], there are hardly techniques available in the λ-calculus to prove that two λ-terms are not β-convertible. Techniques employing the usual Böhm Trees are inadequate when we deal with terms having the same Böhm Tree (BT). This is the case in particular for fixed point combinators, as they all have the same BT. Another interesting equation, whose consideration was sugg...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2008
ISSN: 1660-1769
DOI: 10.5381/jot.2008.7.3.c4